Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs
نویسندگان
چکیده
The all-pairs-shortest-length (APSL) problem of a graph is to nd the lengths of the shortest paths between all pairs of vertices. In this paper, we study the APSL problem on chordal bipartite graphs. By a simple reduction, we show that solving the APSL problem on chordal bipartite graphs can be transformed to solving the same problem on certain strongly chordal graphs. Consequently, there is an O(n 2) time-optimal algorithm for this problem.
منابع مشابه
Estimating all pairs shortest paths in restricted graph families : a unified approach ✩ Feodor
In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on di...
متن کاملEstimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on di...
متن کاملUnified All-pairs Shortest Path Algorithms in the Chordal Hierarchy
The objective of this paper is to advance the view that solving the all-pairs shortest path (APSP) problem for a chordal graph G is a two-step process: the first step is determining vertex pairs at distance two (i.c., computing C’) and the second step is finding the vcrtcx pairs at distance three or more. The main technical result here is that the APSP problem for a chordal graph can be solved ...
متن کاملConnected matchings in chordal bipartite graphs
A connected matching in a graph is a collection of edges that are pairwise disjoint but joined by another edge of the graph. Motivated by applications to Hadwiger’s conjecture, Plummer, Stiebitz, and Toft [13] introduced connected matchings and proved that, given a positive integer k, determining whether a graph has a connected matching of size at least k is NPcomplete. Cameron [4] proved that ...
متن کاملNP-completeness results for some problems on subclasses of bipartite and chordal graphs
Extending previous NP-completeness results for the harmonious coloring problem and the pair-complete coloring problem on trees, bipartite graphs and cographs, we prove that these problems are also NP-complete on connected bipartite permutation graphs. We also study the k-path partition problem and, motivated by a recent work of Steiner [G. Steiner, On the k-path partition of graphs, Theoret. Co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 69 شماره
صفحات -
تاریخ انتشار 1999